| 翻訳と辞書 |
| merge algorithm ： ウィキペディア英語版 |
merge algorithm
Merge algorithms are a family of algorithms that run sequentially over multiple sorted lists to produce a single sorted list as output. These algorithms are used as subroutines in various sorting algorithms, most famously merge sort.
== Binary merge ==
The simplest merge algorithm is the one employed in classical merge sort. This ''binary merge'' algorithm takes two sorted lists as input, and repeatedly picks off an element from either the "left" or "right" list, whichever is smaller. When one list is exhausted, it produces all elements from the other list.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「merge algorithm」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|